翻訳と辞書 Words near each other ・ Condé-sur-Iton ・ Condé-sur-l'Escaut ・ Condé-sur-Marne ・ Condé-sur-Noireau ・ Condé-sur-Risle ・ Condé-sur-Sarthe ・ Condé-sur-Seulles ・ Condé-sur-Suippe ・ Condé-sur-Vesgre ・ Condé-sur-Vire ・ Condécourt ・ Condéon ・ Cone ・ Cone (category theory) ・ Cone (disambiguation) ・ Cone (formal languages) ・ Cone (linear algebra) ・ Cone (software) ・ Cone (topology) ・ Cone algorithm ・ Cone Athletic Park ・ Cone beam computed tomography ・ Cone beam reconstruction ・ Cone bush ・ Cone calorimeter ・ Cone cell ・ Cone clutch ・ Cone dystrophy ・ Cone Five ・ Cone Glacier Volcano Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Cone (formal languages) ： ウィキペディア英語版 Cone (formal languages) In formal language theory, a cone is a set of formal languages that has some desirable closure properties enjoyed by some well-known sets of languages, in particular by the families of regular languages, context-free languages and the recursively enumerable languages. The concept of a cone is a more abstract notion that subsumes all of these families. A similar notion is the faithful cone, having somewhat relaxed conditions. For example, the context-sensitive languages do not form a cone, but still have the required properties to form a faithful cone. The terminology ''cone'' has a French origin. In the American oriented literature one usually speaks of a ''full trio''. The ''trio'' corresponds to the faithful cone. ==Definition== A cone is a non-empty family $\backslash mathcal$ of languages such that, for any $L\; \backslash in\; \backslash mathcal$ over some alphabet $\backslash Sigma$, * if $h$ is a homomorphism from $\backslash Sigma^\backslash ast$ to some $\backslash Delta^\backslash ast$, the language $h(L)$ is in $\backslash mathcal$; * if $h$ is a homomorphism from some $\backslash Delta^\backslash ast$ to $\backslash Sigma^\backslash ast$, the language $h^(L)$ is in $\backslash mathcal$; * if $R$ is any regular language over $\backslash Sigma$, then $L\backslash cap\; R$ is in $\backslash mathcal$. The family of all regular languages is contained in any cone. If one restricts the definition to homomorphisms that do not introduce the empty word $\backslash lambda$ then one speaks of a ''faithful cone''; the inverse homomorphisms are not restricted. Within the Chomsky hierarchy, the regular languages, the context-free languages, and the recursively enumerable languages are all cones, whereas the context-sensitive languages and the recursive languages are only faithful cones. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Cone (formal languages)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.